Rudimentary and arithmetical constructive set theory

نویسنده

  • Peter Aczel
چکیده

The CST conceptual framework is a set theoretical approach to constructive mathematics initiated by Myhill in [Myh75]. It has been given a philosophical foundation via formal interpretations into versions of Martin-Löf’s Intuitionistic Type Theory, [GA06, Acz86, Acz82, Acz78]. There are several axiom systems for Constructive Set Theory of varying logical strength. Perhaps the most familiar ones are CZF and CZF ≡ CZF + REA, see [AR01]. The axiom system CZF is formulated in the first order language L∈ for intuitionistic logic with equality having ∈, an infix binary relation symbol, as the only non-logical symbol. So the logical symbols are ⊥,∧,∨,→,∀,∃,=. We use the standard abbreviations for ↔ , ¬ and the bounded quantifiers (∀x ∈ t) and (∃x ∈ t). A formula is bounded if all its quantifiers are bounded. We assume a standard axiom system for intuitionistic logic with equality. The non-logical axioms and schemes of CZF are the axioms of Extensionality, Emptyset, Union, Pairing and Infinity and the axiom schemes of Bounded

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructive Mathematical Truth

We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Π 2 and Σ 2 hard, and we conjecture it to be complete for second order arithmetic. A statement is constructively true iff it is realized by a constructive function under continuous function realiza...

متن کامل

Inaccessible set axions may have little consistency strength

The paper investigates inaccessible set axioms and their consistency strength in constructive set theory. In ZFC inaccessible sets are of the form Vκ where κ is a strongly inaccessible cardinal and Vκ denotes the κ th level of the von Neumann hierarchy. Inaccessible sets figure prominently in category theory as Grothendieck universes and are related to universes in type theory. The objective of...

متن کامل

Unavoidable sequences in constructive analysis

Kleene’s formalization FIM of intuitionistic analysis ([3] and [2]) includes bar induction, countable and continuous choice, but is consistent with the statement that there are no non-recursive functions ([5]). Veldman ([12]) showed that in FIM the constructive analytical hierarchy collapses at Σ 2 . These are serious obstructions to interpreting the constructive content of classical analysis, ...

متن کامل

Provident sets and rudimentary set forcing

Using the theory of rudimentary recursion and provident sets developed in a previous paper, we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen’s Jω. Much of the development is rudimentary or at worst given by rudimentary...

متن کامل

Development and Validation of a Parenting Styles Scale based on Glasser\'s Choice Theory

The present study set out to develop and validate a parenting styles questionnaire based on Glasser’s choice theory. The design of this quantitative research was correlational. The statistical population of the study was comprised of all parents of 7- to 18-year-old students in District 6 of Tehran in 2018. The drawn sample (N= 360) was selected by random multi-stage cluster sampling method. At...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 164  شماره 

صفحات  -

تاریخ انتشار 2013